Submission #146830
Source Code Expand
#include <cstdio> #include <cstdlib> #include <cmath> #include <climits> #include <cfloat> #include <map> #include <utility> #include <ctime> #include <set> #include <iostream> #include <memory> #include <string> #include <cstring> #include <vector> #include <algorithm> #include <functional> #include <fstream> #include <sstream> #include <complex> #include <stack> #include <queue> #include <cstring> #include <numeric> #include <cassert> using namespace std; static const double EPS = 1e-10; typedef long long ll; #define rep(i,n) for(int i=0;i<n;i++) #define rev(i,n) for(int i=n-1;i>=0;i--) #define all(a) a.begin(),a.end() #define mp(a,b) make_pair(a,b) #define pb(a) push_back(a) #define SS stringstream #define DBG1(a) rep(_X,sz(a)){printf("%d ",a[_X]);}puts(""); #define DBG2(a) rep(_X,sz(a)){rep(_Y,sz(a[_X]))printf("%d ",a[_X][_Y]);puts("");} #define bitcount(b) __builtin_popcount(b) #define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i) #define delete(a,n) a.erase(remove(all(a),n),a.end()) template<typename T, typename S> vector<T>& operator<<(vector<T>& a, S b) { a.push_back(b); return a; } template<typename T> void operator>>(vector<T>& a, int b) {while(b--)if(!a.empty())a.pop_back();} bool isprime(int n){ if(n<2)return false; for(int i=2;i*i<=n;i++)if(n%i==0)return false; return true;} ll b_pow(ll x,ll n){return n ? b_pow(x*x,n/2)*(n%2?x:1) : 1ll;} string itos(int n){stringstream ss;ss << n;return ss.str();} int main(){ int x; cin >> x; vector<int> y(x); for(int i = 0 ; i < x ; i++) cin >> y[i]; sort(y.begin(),y.end()); cout << y[0] << endl; }
Submission Info
Submission Time | |
---|---|
Task | B - おいしいたこ焼きの食べ方 |
User | kyuridenamida |
Language | C++ (G++ 4.6.4) |
Score | 100 |
Code Size | 1658 Byte |
Status | AC |
Exec Time | 26 ms |
Memory | 932 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 100 / 100 | ||
Status |
|
Set Name | Test Cases |
---|---|
All | rand0.txt, rand1.txt, rand10.txt, rand11.txt, rand12.txt, rand13.txt, rand14.txt, rand15.txt, rand16.txt, rand17.txt, rand18.txt, rand19.txt, rand2.txt, rand20.txt, rand21.txt, rand22.txt, rand23.txt, rand24.txt, rand25.txt, rand26.txt, rand27.txt, rand28.txt, rand29.txt, rand3.txt, rand4.txt, rand5.txt, rand6.txt, rand7.txt, rand8.txt, rand9.txt, s1.txt, s2.txt, s3.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
rand0.txt | AC | 22 ms | 740 KB |
rand1.txt | AC | 21 ms | 804 KB |
rand10.txt | AC | 20 ms | 804 KB |
rand11.txt | AC | 20 ms | 800 KB |
rand12.txt | AC | 20 ms | 928 KB |
rand13.txt | AC | 20 ms | 804 KB |
rand14.txt | AC | 21 ms | 736 KB |
rand15.txt | AC | 21 ms | 744 KB |
rand16.txt | AC | 21 ms | 808 KB |
rand17.txt | AC | 21 ms | 756 KB |
rand18.txt | AC | 20 ms | 800 KB |
rand19.txt | AC | 21 ms | 808 KB |
rand2.txt | AC | 21 ms | 816 KB |
rand20.txt | AC | 21 ms | 680 KB |
rand21.txt | AC | 21 ms | 928 KB |
rand22.txt | AC | 21 ms | 808 KB |
rand23.txt | AC | 20 ms | 928 KB |
rand24.txt | AC | 20 ms | 924 KB |
rand25.txt | AC | 20 ms | 804 KB |
rand26.txt | AC | 26 ms | 928 KB |
rand27.txt | AC | 20 ms | 804 KB |
rand28.txt | AC | 24 ms | 804 KB |
rand29.txt | AC | 20 ms | 800 KB |
rand3.txt | AC | 20 ms | 804 KB |
rand4.txt | AC | 20 ms | 804 KB |
rand5.txt | AC | 21 ms | 804 KB |
rand6.txt | AC | 21 ms | 808 KB |
rand7.txt | AC | 21 ms | 932 KB |
rand8.txt | AC | 21 ms | 740 KB |
rand9.txt | AC | 21 ms | 796 KB |
s1.txt | AC | 20 ms | 804 KB |
s2.txt | AC | 21 ms | 932 KB |
s3.txt | AC | 21 ms | 808 KB |