Submission #10093

#TimeUsernameProblemLanguageResultExecution timeMemory
10093gs14004대표 선수 (KOI11_player)C++98
20 / 20
292 ms13504 KiB
#include <cstdio> #include <algorithm> #include <utility> #include <vector> using namespace std; typedef pair<int,int> pi; vector<pi> a; int n,m; int v[1005], cnt; int main(){ int t; scanf("%d %d",&n,&m); for (int i=0; i<n; i++) { for (int j=0; j<m; j++) { scanf("%d",&t); a.push_back(pi(t,i+1)); } } sort(a.begin(),a.end()); int ep = 0; int res = 1e9; for (int i=0; i<a.size(); i++) { while (cnt < n && ep < a.size()) { if(v[a[ep].second] == 0) cnt++; v[a[ep].second]++; ep++; } if(ep == a.size()) break; res = min(res,a[ep-1].first - a[i].first); if(v[a[i].second] == 1) cnt--; v[a[i].second]--; } printf("%d",res); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...